What makes hot beverage vending machine cups eco-friendly? A research into consumer views and preferences

Purpose: This study aims to gain a first explorative view on what intrinsic/extrinsic attributes a generic cup for hot beverage should possess to be perceived as eco-friendly, and how some attributes of a hot beverage could influence consumers’ purchase decision and willingness to pay (WTP) for that beverage dispensed by vending machines (VMs). Design/methodology/approach: A questionnaire was developed in 2021 and sent to all students of an Italian university campus. For the first goal, students were asked to assign a score to some eco-friendly intrinsic/extrinsic attributes using a five-point Likert scale. For the second aim, a choice experiment with six scenarios was developed. Findings: Both intrinsic and extrinsic attributes play a key role in shaping students’ opinions and preferences. Results indicate that students are attracted by the idea of a cup that communicates its environmental properties through corresponding labels and information, and it is made by materials that guarantee biodegradability, recyclability or reusability. Originality/value: The research represents the first academic attempt to provide a first consumers’ viewpoint on the importance of eco-friendly attributes of cups for hot beverages able to influence consumers’ perceptions and consumption choices of hot beverages dispensed by VMs

Prioritized Repairing and Consistent Query Answering in Relational Databases

A consistent query answer in an inconsistent database is an answer obtained in every (minimal) repair. The repairs are obtained by resolving all conflicts in all possible ways. Often, however, the user is able to provide a preference on how conflicts should be resolved. We investigate here the framework of preferred consistent query answers, in which user preferences are used to narrow down the set of repairs to a set of preferred repairs. We axiomatize desirable properties of preferred repairs. We present three different families of preferred repairs and study their mutual relationships. Finally, we investigate the complexity of preferred repairing and computing preferred consistent query answers.Comment: Accepted to the special SUM'08 issue of AMA

Перші християнські святині Києва: біля витоків національного державотворення

The low vigour of plantlets resulting from oil palm somatic embryos may be due to insufficient levels of deposited storage proteins. Thus, in order to improve embryonic maturation and the vigour of regenerated plantlets, we investigated the effects of modifying the culture conditions with respect to the accumulation of the major oil palm storage proteins, the 7S globulins. In this study, the effect of arginine and glutamine on globulin accumulation was studied using somatic embryos of two different genotypes. Arginine and glutamine were both found to enhance protein accumulation but in different ways, which were best illustrated by measurements of soluble proteins per embryo and 7S globulin content per dry weight. Arginine increased the level of soluble proteins by 46% irrespective of the clone, and glutamine by 19% and 63% depending on the clone. The clone which accumulated the least protein in the presence of glutamine was that which contained the more protein initially. Only arginine favoured the accumulation of 7S globulin content per dry weight, irrespective of the clone considered (+26%). This study will enable further investigations of specific storage proteins as potential markers for regenerated plantlets vigour.(Résumé d'auteur

The complexity of dominating set reconfiguration

Suppose that we are given two dominating sets $D_s$ and $D_t$ of a graph $G$ whose cardinalities are at most a given threshold $k$. Then, we are asked whether there exists a sequence of dominating sets of $G$ between $D_s$ and $D_t$ such that each dominating set in the sequence is of cardinality at most $k$ and can be obtained from the previous one by either adding or deleting exactly one vertex. This problem is known to be PSPACE-complete in general. In this paper, we study the complexity of this decision problem from the viewpoint of graph classes. We first prove that the problem remains PSPACE-complete even for planar graphs, bounded bandwidth graphs, split graphs, and bipartite graphs. We then give a general scheme to construct linear-time algorithms and show that the problem can be solved in linear time for cographs, trees, and interval graphs. Furthermore, for these tractable cases, we can obtain a desired sequence such that the number of additions and deletions is bounded by $O(n)$, where $n$ is the number of vertices in the input graph

Algorithmic aspects of disjunctive domination in graphs

For a graph $G=(V,E)$, a set $D\subseteq V$ is called a \emph{disjunctive dominating set} of $G$ if for every vertex $v\in V\setminus D$, $v$ is either adjacent to a vertex of $D$ or has at least two vertices in $D$ at distance $2$ from it. The cardinality of a minimum disjunctive dominating set of $G$ is called the \emph{disjunctive domination number} of graph $G$, and is denoted by $\gamma_{2}^{d}(G)$. The \textsc{Minimum Disjunctive Domination Problem} (MDDP) is to find a disjunctive dominating set of cardinality $\gamma_{2}^{d}(G)$. Given a positive integer $k$ and a graph $G$, the \textsc{Disjunctive Domination Decision Problem} (DDDP) is to decide whether $G$ has a disjunctive dominating set of cardinality at most $k$. In this article, we first propose a linear time algorithm for MDDP in proper interval graphs. Next we tighten the NP-completeness of DDDP by showing that it remains NP-complete even in chordal graphs. We also propose a $(\ln(\Delta^{2}+\Delta+2)+1)$-approximation algorithm for MDDP in general graphs and prove that MDDP can not be approximated within $(1-\epsilon) \ln(|V|)$ for any $\epsilon>0$ unless NP $\subseteq$ DTIME$(|V|^{O(\log \log |V|)})$. Finally, we show that MDDP is APX-complete for bipartite graphs with maximum degree $3$

Efficient Location Training Protocols for Localization in Heterogeneous Sensor and Actor Networks

International audienceAbstract--In this work we consider a large-scale geographic area populated by tiny sensors and some more powerful devices called actors, authorized to organize the sensors in their vicinity into short-lived, actor-centric sensor networks. The tiny sensors run on miniature non-rechargeable batteries, are anonymous and are unaware of their location. The sensors differ in their ability to dynamically alter their sleep times. Indeed, the periodic sensors have sleep periods of predefined lengths, established at fabrication time; by contrast, the free sensors can dynamically alter their sleep periods, under program control. The main contribution of this work is to propose an energy-efficient location training protocol for heterogeneous actor-centric sensor networks where the sensors acquire coarse-grain location awareness with respect to the actor in their vicinity. Our analytical analysis, confirmed by experimental evaluation, show that the proposed protocol outperforms the best previously-known location training protocols in terms of the number of sleep/awake transitions, overall sensor awake time, and energy consumption

Efficient Binary scheme for Training Heterogeneous Sensor Actor Networks

International audienceSensor networks are expected to evolve into long-lived, autonomous networked systems whose main mission is to provide in-situ users – called actors – with real-time information in support of specific goals supportive of their mission. The network is populated with a heterogeneous set of tiny sensors. The free sensors alternate between sleep and awake periods, under program control in response to computational and communication needs. The periodic sensors alternate between sleep periods and awake periods of predefined lengths, established at the fabrication time. The architectural model of an actor-centric network used in this work comprises in addition to the tiny sensors a set of mobile actors that organize and manage the sensors in their vicinity. We take the view that the sensors deployed are anonymous and unaware of their geographic location. Importantly, the sensors are not, a priori, organized into a network. It is, indeed, the interaction between the actors and the sensor population that organizes the sensors in a disk around each actor into a short-lived, mission-specific, network that exists for the purpose of serving the actor and that will be disbanded when the interaction terminates. The task of setting up this form of actor-centric network involves a training stage where the sensors acquire dynamic coordinates relative to the actor in their vicinity. The main contribution of this work is to propose an energy- efficient training protocol for actor-centric heterogeneous sensor networks. Our protocol outperforms all know training protocols in the number of sleep/awake transitions per sensor needed by the training process. Specifically, in the presence of $k$ coronas, no sensor will experience more than$\lceil log(k)\rceil$ sleep/awake transitions and awake periods